The generator matrix

 1  0  1  1  1  0  1  1  0  1  1  0  1  1  X  1  1  X  1  1  X  1  1  X  1  1  0  1  1  0  1  1  0  1  1  0  1  1  1  1  1  1  1  1  X  X  X  X  X  X  X  X  X  X  0  0  0  0  0  0  1  1  1  1  0  X  1  1  1  1  0  X  X  X  0  X  X  X  0  X  1
 0  1  1  0 X+1  1  0 X+1  1  0  1  1  X X+1  1  X X+1  1  X  1  1  X  1  1  0 X+1  1  0 X+1  1  0 X+1  1  0 X+1  1  X  X  X  X  1  1  1  1  1  1  1  1  0  0  0  X  X  X  X  X  X  0  0  0  0  X X+1  1  1  1  0  X X+1  1  1  1  0  X  X  0  0  X  X  0  0
 0  0  X  0  X  0  X  0  X  X  0  X  X  0  X  0  X  0  X  X  X  0  0  0  0  0  0  X  X  X  0  0  X  X  X  0  X  X  0  0  X  X  0  0  X  X  0  0  0  X  X  X  X  0  0  X  X  X  X  0  0  0  0  0  0  0  X  X  X  X  X  X  0  0  0  0  X  X  0  0  0
 0  0  0  X  X  X  X  0  0  0  X  X  0  X  0  X  0  X  X  X  X  0  0  0  0  0  X  X  X  0  X  X  X  0  0  0  0  X  X  0  0  X  X  0  0  X  X  0  X  X  0  0  X  X  X  X  0  0  X  X  0  0  0  0  X  X  X  X  X  X  0  0  0  0  0  X  0  0  X  0  0

generates a code of length 81 over Z2[X]/(X^2) who´s minimum homogenous weight is 80.

Homogenous weight enumerator: w(x)=1x^0+15x^80+16x^81+15x^82+16x^85+1x^98

The gray image is a linear code over GF(2) with n=162, k=6 and d=80.
As d=80 is an upper bound for linear (162,6,2)-codes, this code is optimal over Z2[X]/(X^2) for dimension 6.
This code was found by Heurico 1.16 in 0.0933 seconds.